package com.sxkiler.demo.medium;

import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
import java.util.*;
import com.sxkiler.demo.model.*;

/**
find-bottom-left-tree-value=找树左下角的值
<p>给定一个二叉树，在树的最后一行找到最左边的值。</p>

<p><strong>示例 1:</strong></p>

<pre>
<strong>输入:</strong>

    2
   / \
  1   3

<strong>输出:</strong>
1
</pre>

<p>&nbsp;</p>

<p><strong>示例 2: </strong></p>

<pre>
<strong>输入:</strong>

        1
       / \
      2   3
     /   / \
    4   5   6
       /
      7

<strong>输出:</strong>
7
</pre>

<p>&nbsp;</p>

<p><strong>注意:</strong> 您可以假设树（即给定的根节点）不为 <strong>NULL</strong>。</p>

 */
public class findBottomLeftValue {
    

    class Solution {
        public Integer findBottomLeftValue(TreeNode param0) {
            return null;
        }
    }

    @Test
    public void test(){
        Solution solution = new Solution();
        /**
        [2,1,3]
        */
        //int [] num1 = new int[]{1,3};
        //int [] num2 = new int[]{2};
        //Assertions.assertEquals(solution.{{questionName}}(num1,num2),2);
    }
}

